2
2.0

Jun 30, 2018
06/18

by
Jean-Guillaume Dumas; Erich Kaltofen

texts

#
eye 2

#
favorite 0

#
comment 0

Certificates to a linear algebra computation are additional data structures for each output, which can be used by a---possibly randomized---verification algorithm that proves the correctness of each output. The certificates are essentially optimal if the time (and space) complexity of verification is essentially linear in the input size $N$, meaning $N$ times a factor $N^{o(1)}$, i.e., a factor $N^{\eta(N)}$ with $\lim_{N\to \infty} \eta(N)$ $=$ $0$. We give algorithms that compute essentially...

Topics: Symbolic Computation, Computing Research Repository

Source: http://arxiv.org/abs/1401.4567

10
10.0

audio

#
eye 10

#
favorite 0

#
comment 0

Topics: Radio Program, Sociological terminology, Scotland, Population, Interpersonal relationships,...

3
3.0

Jun 29, 2018
06/18

by
Ikuya Yamada; Hiroyuki Shindo; Hideaki Takeda; Yoshiyasu Takefuji

texts

#
eye 3

#
favorite 0

#
comment 0

Named Entity Disambiguation (NED) refers to the task of resolving multiple named entity mentions in a document to their correct references in a knowledge base (KB) (e.g., Wikipedia). In this paper, we propose a novel embedding method specifically designed for NED. The proposed method jointly maps words and entities into the same continuous vector space. We extend the skip-gram model by using two models. The KB graph model learns the relatedness of entities using the link structure of the KB,...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1601.01343

Atmospheric CO2 is a critical forcing for the Earth's climate and the knowledge on its distributions and variations influences predictions of the Earth's future climate. Large uncertainties in the predictions persist due to limited observations. This study uses the airborne Intensity-Modulated Continuous-Wave (IMCW) lidar developed at NASA Langley Research Center to measure regional atmospheric CO2 spatio-temporal variations. Further lidar development and demonstration will provide the...

Topics: Browell, Edward, Campbell, Joel, Dobler, Jeremy, Exelis, Inc., Fan, Tai-Fang, Harrison, F. Wallace,...

2
2.0

Jun 29, 2018
06/18

by
Konstantinos Makantasis; Antonis Nikitakis; Anastasios Doulamis; Nikolaos Doulamis; Yannis Papaefstathiou

texts

#
eye 2

#
favorite 0

#
comment 0

Detection of moving objects in videos is a crucial step towards successful surveillance and monitoring applications. A key component for such tasks is usually called background subtraction and tries to extract regions of interest from the image background for further processing or action. For this reason, its accuracy and its real-time performance is of great significance. Although, effective background subtraction methods have been proposed, only a few of them take into consideration the...

Topics: Computer Vision and Pattern Recognition, Computing Research Repository

Source: http://arxiv.org/abs/1608.00229

2
2.0

Jun 30, 2018
06/18

by
Katarzyna Paluch

texts

#
eye 2

#
favorite 0

#
comment 0

In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. In this paper we give a fast combinatorial $\frac 34$-approximation algorithm for Max ATSP. It is based on a novel use of {\it half-edges}, matchings and a new method of edge coloring. (A {\it half-edge} of edge $(u,v)$ is informally speaking "either a head or a tail of...

Topics: Discrete Mathematics, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1401.3670

2
2.0

Jun 29, 2018
06/18

by
Palash Dey

texts

#
eye 2

#
favorite 0

#
comment 0

The domain of single crossing preference profiles is a widely studied domain in social choice theory. It has been generalized to the domain of single crossing preference profiles with respect to trees which inherits many desirable properties from the single crossing domain, for example, transitivity of majority relation, existence of polynomial time algorithms for finding winners of Kemeny voting rule, etc. In this paper, we consider a further generalization of the domain of single crossing...

Topics: Artificial Intelligence, Data Structures and Algorithms, Computing Research Repository, Multiagent...

Source: http://arxiv.org/abs/1611.04175

4
4.0

audio

#
eye 4

#
favorite 0

#
comment 0

Topics: Radio Program, Money, Stock market, Financial risk, Financial markets, Mathematical finance,...

4
4.0

Jun 29, 2018
06/18

by
Yu Wu; Wei Wu; Zhoujun Li; Ming Zhou

texts

#
eye 4

#
favorite 0

#
comment 0

We consider incorporating topic information into message-response matching to boost responses with rich content in retrieval-based chatbots. To this end, we propose a topic-aware convolutional neural tensor network (TACNTN). In TACNTN, matching between a message and a response is not only conducted between a message vector and a response vector generated by convolutional neural networks, but also leverages extra topic information encoded in two topic vectors. The two topic vectors are linear...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1605.00090

3
3.0

Jun 29, 2018
06/18

by
Hojjat Salehinejad

texts

#
eye 3

#
favorite 0

#
comment 0

The advantage of recurrent neural networks (RNNs) in learning dependencies between time-series data has distinguished RNNs from other deep learning models. Recently, many advances are proposed in this emerging field. However, there is a lack of comprehensive review on memory models in RNNs in the literature. This paper provides a fundamental review on RNNs and long short term memory (LSTM) model. Then, provides a surveys of recent advances in different memory enhancements and learning...

Topics: Neural and Evolutionary Computing, Computing Research Repository

Source: http://arxiv.org/abs/1602.04335

9
9.0

audio

#
eye 9

#
favorite 0

#
comment 0

Topics: Radio Program, Christmas-linked holidays, Christmas traditions, Christmas, December observances,...

3
3.0

Jun 30, 2018
06/18

by
Che-Yu Liu; Sébastien Bubeck

texts

#
eye 3

#
favorite 0

#
comment 0

We study the problem of finding the most mutually correlated arms among many arms. We show that adaptive arms sampling strategies can have significant advantages over the non-adaptive uniform sampling strategy. Our proposed algorithms rely on a novel correlation estimator. The use of this accurate estimator allows us to get improved results for a wide range of problem instances.

Topics: Machine Learning, Computing Research Repository, Statistics, Learning

Source: http://arxiv.org/abs/1404.5903

3
3.0

Jun 28, 2018
06/18

by
Emmanuel Jeandel

texts

#
eye 3

#
favorite 0

#
comment 0

We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].

Topics: Mathematics, Discrete Mathematics, Computing Research Repository, Group Theory

Source: http://arxiv.org/abs/1510.02360

Topics: Radio Program, Public relations, Stock market, Journalism, Market research, Political terminology,...

4
4.0

Jun 29, 2018
06/18

by
Matthew Aldridge; Oliver Johnson; Jonathan Scarlett

texts

#
eye 4

#
favorite 0

#
comment 0

We consider nonadaptive group testing where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has (almost) constant column weights. We show that performance is improved compared to Bernoulli designs, where each item is placed in each test independently with a fixed probability. In particular, we show that the rate of the practical COMP detection algorithm is increased by 31% in all sparsity regimes. In dense...

Topics: Statistics Theory, Statistics, Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1602.03471

4
4.0

Jun 30, 2018
06/18

by
Volodymyr Kuleshov; Doina Precup

texts

#
eye 4

#
favorite 0

#
comment 0

Although many algorithms for the multi-armed bandit problem are well-understood theoretically, empirical confirmation of their effectiveness is generally scarce. This paper presents a thorough empirical study of the most popular multi-armed bandit algorithms. Three important observations can be made from our results. Firstly, simple heuristics such as epsilon-greedy and Boltzmann exploration outperform theoretically sound algorithms on most settings by a significant margin. Secondly, the...

Topics: Computing Research Repository, Artificial Intelligence, Learning

Source: http://arxiv.org/abs/1402.6028

3
3.0

Jun 30, 2018
06/18

by
Souvik Chandra; Dhagash Mehta; Aranya Chakrabortty

texts

#
eye 3

#
favorite 0

#
comment 0

The solution space of any set of power flow equations may contain different number of real-valued solutions. The boundaries that separate these regions are referred to as power flow solution space boundaries. Knowledge of these boundaries is important as they provide a measure for voltage stability. Traditionally, continuation based methods have been employed to compute these boundaries on the basis of initial guesses for the solution. However, with rapid growth of renewable energy sources...

Topics: Systems and Control, Algebraic Geometry, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1704.04792

7
7.0

Jun 30, 2018
06/18

by
Hana Ajakan; Pascal Germain; Hugo Larochelle; François Laviolette; Mario Marchand

texts

#
eye 7

#
favorite 0

#
comment 0

We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predictions must be made based on a data representation that cannot discriminate between the training (source) and test (target) domains. We propose a training objective that implements...

Topics: Machine Learning, Neural and Evolutionary Computing, Computing Research Repository, Statistics,...

Source: http://arxiv.org/abs/1412.4446

5
5.0

audio

#
eye 5

#
favorite 0

#
comment 0

Topics: Radio Program, Noble titles, G20 nations, Soups, Violence, Childhood, Mental processes,...

7
7.0

Jun 29, 2018
06/18

by
Fereshteh Asgari; Alexis Sultan; Haoyi Xiong; Vincent Gauthier; Mounim El-Yacoubi

texts

#
eye 7

#
favorite 0

#
comment 0

Mobile phone data have recently become an attractive source of information about mobility behavior. Since cell phone data can be captured in a passive way for a large user population, they can be harnessed to collect well-sampled mobility information. In this paper, we propose CT-Mapper, an unsupervised algorithm that enables the mapping of mobile phone traces over a multimodal transport network. One of the main strengths of CT-Mapper is its capability to map noisy sparse cellular multimodal...

Topics: Learning, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1604.06577

3
3.0

Jun 29, 2018
06/18

by
Arash Shahriari

texts

#
eye 3

#
favorite 0

#
comment 0

Pruning of redundant or irrelevant instances of data is a key to every successful solution for pattern recognition. In this paper, we present a novel ranking-selection framework for low-length but highly correlated instances. Instead of working in the low-dimensional instance space, we learn a supervised projection to high-dimensional space spanned by the number of classes in the dataset under study. Imposing higher distinctions via exposing the notion of labels to the instances, lets to deploy...

Topics: Machine Learning, Learning, Computer Vision and Pattern Recognition, Computing Research Repository,...

Source: http://arxiv.org/abs/1606.07575

4
4.0

Jun 29, 2018
06/18

by
Dylan Hutchison; Bill Howe; Dan Suciu

texts

#
eye 4

#
favorite 0

#
comment 0

Data processing systems roughly group into families such as relational, array, graph, and key-value. Many data processing tasks exceed the capabilities of any one family, require data stored across families, or run faster when partitioned onto multiple families. Discovering ways to execute computation among multiple available systems, let alone discovering an optimal execution plan, is challenging given semantic differences between disparate families of systems. In this paper we introduce a new...

Topics: Databases, Programming Languages, Computing Research Repository

Source: http://arxiv.org/abs/1604.03607

4
4.0

Jun 30, 2018
06/18

by
Silas L. Fong; Vincent Y. F. Tan

texts

#
eye 4

#
favorite 0

#
comment 0

This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the set of achievable rate tuples. The strong converse for these classes of DM-MMNs implies that all sequences of codes with rate tuples belonging to the exterior of the cut-set bound have average error probabilities that necessarily tend to one (and are not simply bounded away from zero)....

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1407.2417

Topics: Radio Program, Business terms, Health care, Market research, International trade, Taxation, Health,...

2
2.0

Dec 20, 2016
12/16

by
George Mason University

movies

#
eye 2

#
favorite 0

#
comment 0

GMU-TV is a live stream by the public research university George Mason University.

Topics: videobot, archiveteam, gmu-tv, gmutv, live, stream, livestream, george, mason, university, research

Topics: Radio Program, American Enterprise Institute, Debt, Survey methodology, Business law, Credit cards,...

2
2.0

Jun 30, 2018
06/18

by
Tobias Gruber; Sebastian Cammerer; Jakob Hoydis; Stephan ten Brink

texts

#
eye 2

#
favorite 0

#
comment 0

We revisit the idea of using deep neural networks for one-shot decoding of random and structured codes, such as polar codes. Although it is possible to achieve maximum a posteriori (MAP) bit error rate (BER) performance for both code families and for short codeword lengths, we observe that (i) structured codes are easier to learn and (ii) the neural network is able to generalize to codewords that it has never seen during training for structured, but not for random codes. These results provide...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1701.07738

2
2.0

Jun 29, 2018
06/18

by
Nikolaus Hansen; Anne Auger; Olaf Mersmann; Tea Tusar; Dimo Brockhoff

texts

#
eye 2

#
favorite 0

#
comment 0

COCO is a platform for Comparing Continuous Optimizers in a black-box setting. It aims at automatizing the tedious and repetitive task of benchmarking numerical optimization algorithms to the greatest possible extent. We present the rationals behind the development of the platform as a general proposition for a guideline towards better benchmarking. We detail underlying fundamental concepts of COCO such as its definition of a problem, the idea of instances, the relevance of target values, and...

Topics: Machine Learning, Artificial Intelligence, Numerical Analysis, Computing Research Repository,...

Source: http://arxiv.org/abs/1603.08785

25
25

Sep 12, 2009
09/09

by
NASA/Glenn Research Center

image

#
eye 25

#
favorite 0

#
comment 0

Cessna Tail Wing Section in Icing Research Tunnel (IRT)

Topic: What -- Icing Research Tunnel (IRT)

Topics: Radio Program, American political writers, American talk radio hosts, American anti-communists,...

10
10.0

audio

#
eye 10

#
favorite 0

#
comment 0

Topics: Radio Program, Seaside resorts in England, Member states of the Commonwealth of Nations, Republics,...

4
4.0

May 26, 2016
05/16

by
George Mason University

movies

#
eye 4

#
favorite 0

#
comment 0

GMU-TV is a live stream by the public research university George Mason University.

Topics: videobot, archiveteam, gmu-tv, gmutv, live, stream, livestream, george, mason, university, research

4
4.0

Jun 28, 2018
06/18

by
Kent Tsz Kan Cheung; Shaoshi Yang; Lajos Hanzo

texts

#
eye 4

#
favorite 0

#
comment 0

The energy spectral efficiency maximization (ESEM) problem of a multi-user, multi-relay, multi-cell system is considered, where all the network nodes are equipped with multi-antenna transceivers. To deal with the potentially excessive interference originating from a plethora of geographically distributed transmission sources, a pair of transmission protocols based on interference alignment (IA) are conceived. The first, termed the full-IA, avoids all intra-cell interference (ICI) and other-cell...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1510.01385

Topics: Radio Program, Presidency of Barack Obama, Higher education, Business, American billionaires,...

3
3.0

Jun 29, 2018
06/18

by
J. M. Landsberg; Mateusz Michałek

texts

#
eye 3

#
favorite 0

#
comment 0

Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n.

Topics: Algebraic Geometry, Computational Complexity, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.07486

As part of the Air Force - NASA Bi-Annual Research Council Meeting, slides will be presented on recent Reduced Crew Operations (RCO) work. Unmanned aerial systems, robotics, advanced cockpits, and air traffic management are all examples of domains that are seeing dramatic increases in automation. While automation may take on some tasks previously performed by humans, humans will still be required, for the foreseeable future, to remain in the system. The collaboration with humans and these...

Topics: ASRC Research and Technology Solutions, LLC, Battiste, Henri, Brandt, Summer L., Lachter, Joel,...

4
4.0

Jun 29, 2018
06/18

by
Chanfei Wang; Tiejun Lv; Hui Gao; Shaoshi Yang

texts

#
eye 4

#
favorite 0

#
comment 0

Soft noncoherent detection, which relies on calculating the \textit{a posteriori} probabilities (APPs) of the bits transmitted with no channel estimation, is imperative for achieving excellent detection performance in high-dimensional wireless communications. In this paper, a high-performance belief propagation (BP)-based soft multiple-symbol differential detection (MSDD) framework, dubbed BP-MSDD, is proposed with its illustrative application in differential space-time block-code (DSTBC)-aided...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1608.01296

9
9.0

Jun 29, 2018
06/18

by
Junaid Qadir; Arjuna Sathiaseelan; Liang Wang; Jon Crowcroft

texts

#
eye 9

#
favorite 0

#
comment 0

Internet is the linchpin of modern society, which the various threads of modern life weave around. But being a part of the bigger energy-guzzling industrial economy, it is vulnerable to disruption. It is widely believed that our society is exhausting its vital resources to meet our energy requirements, and the cheap fossil fuel fiesta will soon abate as we cross the tipping point of global oil production. We will then enter the long arc of scarcity, constraints, and limits---a post-peak...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1602.08135

4
4.0

Jun 30, 2018
06/18

by
Luis Gerardo Mojica

texts

#
eye 4

#
favorite 0

#
comment 0

An-ever increasing number of social media websites, electronic newspapers and Internet forums allow visitors to leave comments for others to read and interact. This exchange is not free from participants with malicious intentions, which do not contribute with the written conversation. Among different communities users adopt strategies to handle such users. In this paper we present a comprehensive categorization of the trolling phenomena resource, inspired by politeness research and propose a...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1704.02385

88 p. ; 28 cm

Topics: Agriculture Economic aspects United States., Economics Research United States.

4
4.0

Jun 30, 2018
06/18

by
Ashwin Pananjady; Vivek Kumar Bagaria; Rahul Vaze

texts

#
eye 4

#
favorite 0

#
comment 0

Given a universe $U$ of $n$ elements and a collection of subsets $\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a collection of subsets whose union is $U$. We consider the online DSCP, in which the subsets arrive one by one (possibly in an order chosen by an adversary), and must be irrevocably assigned to some partition on arrival with the objective of minimizing the...

Topics: Networking and Internet Architecture, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1411.5739

Topics: Radio Program, Hospitality industry, Types of insurance, American monthly magazines, Magazines...

7
7.0

audio

#
eye 7

#
favorite 0

#
comment 0

Topics: Radio Program, Firefighting, Regions of California, Southern California, Prosecution, Legal...

2
2.0

Jun 29, 2018
06/18

by
Israela Solomon

texts

#
eye 2

#
favorite 0

#
comment 0

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set depends only on $d$ (and not on the number of sets $n$). We test the property that there exists a common point in all sets, i.e. that their intersection is nonempty. Our goal is to distinguish between the case where the intersection is nonempty, and the case where...

Topics: Data Structures and Algorithms, Computational Geometry, Computing Research Repository

Source: http://arxiv.org/abs/1612.03735

A series of three convergent, round-to-rectangular high aspect ratio (HAR) nozzles were designed for acoustic testing at the NASA Glenn Research Center Nozzle Acoustic Test Rig (NATR). The HAR nozzles had exit area aspect ratios of 8:1, 12:1, and 16:1. The nozzles were designed to mimic a distributed propulsion system array with a slot nozzle. The nozzle designs were screened using Reynolds-Averaged Navier-Stokes (RANS) simulations. In addition to meeting the geometric constraints required for...

Topics: Dippold, Vance F., III, NASA Glenn Research Center

3
3.0

Jun 29, 2018
06/18

by
Mahdi Haghifam; Behrooz Makki; Masoumeh Nasiri-Kenari; Tommy Svensson

texts

#
eye 3

#
favorite 0

#
comment 0

This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption constraint at the source, we provide closed-form expressions for the optimal time sharing and...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1607.07087

Topics: Radio Program, American Roman Catholics, Secularism, Humanism, Strategic management, Lamas,...

2
2.0

Jun 28, 2018
06/18

by
Yukiko Yamauchi; Taichi Uehara; Masafumi Yamashita

texts

#
eye 2

#
favorite 0

#
comment 0

We consider a swarm of autonomous mobile robots each of which is an anonymous point in the three-dimensional Euclidean space (3D-space) and synchronously executes a common distributed algorithm. We investigate the pattern formation problem that requires the robots to form a given target pattern from an initial configuration and characterize the problem by showing a necessary and sufficient condition for the robots to form a given target pattern. The pattern formation problem in the two...

Topics: Computing Research Repository, Distributed, Parallel, and Cluster Computing

Source: http://arxiv.org/abs/1509.09207

4
4.0

Jun 30, 2018
06/18

by
Jiashi Feng; Huan Xu; Shie Mannor

texts

#
eye 4

#
favorite 0

#
comment 0

We propose a framework for distributed robust statistical learning on {\em big contaminated data}. The Distributed Robust Learning (DRL) framework can reduce the computational time of traditional robust learning methods by several orders of magnitude. We analyze the robustness property of DRL, showing that DRL not only preserves the robustness of the base robust learning method, but also tolerates contaminations on a constant fraction of results from computing nodes (node failures). More...

Topics: Machine Learning, Computing Research Repository, Statistics, Learning

Source: http://arxiv.org/abs/1409.5937

Topics: Radio Program, Health, Sociology, Real estate, Cakes, Traditions, Justice, Shipping, Marketing,...